Adjacent Vertices Fault-tolerance Fanability of Hypercube
نویسندگان
چکیده
In this paper, we introduce the concepts of fault tolerant fanability. We show that the ndimensional hypercube Qn are f-adjacent and l edges fault tolerant (n− f − l)-fanable for n ≥ 3, f + l ≤ n− 2 and l ≥ 1.
منابع مشابه
Adjacent vertices fault-tolerance for bipancyclicity of hypercube∗
A bipartite graph G = (V,E) is bipancyclic if it contains the cycles of every even length from 4 to |V |. Let Fa be the set of fa pairs of adjacent vertices and Fe be the set of fe faulty edges in the n-dimensional hypercube Qn. In this paper, we will show that Qn − Fa − Fe is bipancyclic for fa + fe = n− 2.
متن کاملThe longest ring embedding in faulty hypercube
In this paper, we show that the adjacency fault tolerance for property 2H of hypercube. We also show that the adjacency fault tolerance for Hamiltonian laceability of hypercube. Applying these results, we can construct the fault-free cycle with length 2 − 2 | Fv | +4 in Qn − Fv where Fv is the faulty vertices set with at least two black vertices and two white vertices with | Fv |≤ n− 1.
متن کاملEmbedding various even cycles in a hypercube with node failures
Let fv denote the number of faulty vertices in an n-dimensional hypercube Qn. In this paper, we prove that every fault-free edge of Qn for n ≥ 4 and every fault-free vertex of Qn for n ≥ 3 lies on a fault-free cycle of every even length from 6 to 2 − 2fv inclusive if fv = n− 1, and all faulty vertices are not adjacent to the same vertex.
متن کاملOn the k-subgraphs of the Generalized n-cubes
Graphs are used in modeling interconnections networks and measuring their properties. Knowing and understanding the graph theoretical/combinatorial properties of the underlying networks are necessary in developing more efficient parallel algorithms as well as fault-tolerant communication/routing algorithms [1] The hypercube is one of the most versatile and efficient networks yet discovered for ...
متن کاملOn reliability of the folded hypercubes q
In this paper, we explore the 2-extra connectivity and 2-extra-edge-connectivity of the folded hypercube FQn. We show that j2(FQn) = 3n 2 for n P 8; and k2(FQn) = 3n 1 for n P 5. That is, for n P 8 (resp. n P 5), at least 3n 2 vertices (resp. 3n 1 edges) of FQn are removed to get a disconnected graph that contains no isolated vertices (resp. edges). When the folded hypercube is used to model th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006